Method of interleaving/deinterleaving in a communication system

ABSTRACT

A method of performing interleaving or deinterleaving in a communication system having at least one interleaver at the transmitter and at least one deinterleaver at the receiver. The method includes interleaving or deinterleaving the input bit sequence x n  as follows: y n =x π     n   , n=0, . . . , N−1, using a bridge function between π n  and n, n=0, . . . , N−1, based on a spline linear model. When the system includes a first and a second interleaving or deinterleaving, the method is performed for both. When the second interleaving or deinterleaving includes adding padding bits, the location in the interleaved or deinterleaved bit sequence of the padding bits is determined and interleaving or deinterleaving for the determined locations is skipped.

BACKGROUND AND SUMMARY OF THE INVENTION

[0001] The present invention relates generally to communication systems of coded data and, more specifically, to an improvement in interleaving and deinterleaving of the data.

[0002] Although the present invention will be described with respect to 3^(rd) generation wideband code division multiple access (3G WCDMA) system, the same method can be used for interleaving and/or deinterleaving in other systems. Also for sake of brevity, the method will be described for interleavers, but is also used with deinterleavers. General and specific references will also be made to the 3G WCDMA standard 3GPP TS 25.212: “Multiplexing and channel coding (FDD).”

[0003] In communication systems, most of the well-known codes have been developed to combat against the noise that is assumed to be statistically independent. Typical channel model causing this type of noise would be AWGN (Additive White Gaussian Noise) channel. However, there are some physical channels that show bursty error characteristics, such as mutipath fading channel, in which fading often causes the signal to fall below the noise level and, thus, results in the burst type of error. For reference, see J. Proakis, Digital Communications, McGraw-Hill, 2001.

[0004] The role of interleaving is to shuffle (or to randomize) the positions of errors introduced in channels and, thus, mitigate the effects of burst type noise.

[0005] There are two channel interleavers for 3G WCDMA, namely first and second interleavers. The first interleaver takes a role of inter-frame (in transport channel) interleaving and the second interleavers for intra-frame (in physical channel) interleaving.

[0006] The classical block interleaver writes input data along the rows of a temporary matrix, and read out along the columns of the matrix. The first and second interleavers designed for CDMA are basically a block interleaver with inter-column permutations.

[0007] The present invention is a method of performing interleaving or deinterleaving in a communication system having at least one interleaver at the transmitter and at least one deinterleaver at the receiver. The method includes interleaving or deinterleaving the input bit sequence x_(n) as follows: y_(n)=x_(π) _(n) , n=0, . . . , N−1, using a bridge function between π_(n) and n, n=0, . . . , N−1, based on a spline linear model. The bridge function is π_(n)^(r_(j)) = C × n − j × N + P_(C)(j),

[0008] j=0,1, . . . , C−1, where P_(C)(j) is the permutation pattern and r_(j) denotes the sets of discrete time intervals. Thus, the interleaving or deinterleaving is y_(n)^(r_(j)) = x_(C × n − j × N + P_(C)(j)),

[0009] When the system includes a first and a second interleaving or deinterleaving, the method is performed for both. When the second interleaving or deinterleaving includes adding padding bits, the location in the interleaved or deinterleaved bit sequence of the padding bits is determined and interleaving or deinterleaving for the determined locations is skipped. Wherein y has an index m, and x has an index n, the index m is not increased, and the index n is increased for determined locations of padding.

[0010] The method can be performed without forming a matrix of the bit sequence and in software.

[0011] These and other aspects of the present invention will become apparent from the following detailed description of the invention, when considered in conjunction with accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012]FIG. 1 is a block diagram of the transport channel procedure of the 3G WCDMA system defined in 3GPP TS 25.212.

[0013]FIG. 2 is a flow chart of a method of first/second interleaving incorporating the principles of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] The 3G WCDMA transmitter is shown in FIG. 1. A cycle redundant check (CRC) processes the bit sequence a and produces the CRC attached bit sequence b. A transport block (TrBk) concatenation and code block segmentation is performed before channel coding and produces o. Channel coding block produces encoded bits c. Radio frame equalization produces sequence t. There is a first interleaver whose output d is processed by radio frame segmentation and rate matching producing sequences e and f, respectively. Next, transport channel (TrCH) multiplexing produces a sequence s, which is a coded composite transport channel (CCTrCH). Next, physical channel segmentation produces sequence u, which is transmitted through a second interleaver to produce sequence v. Finally, physical channel mapping is performed to produce physical channels PhCH.

[0015] The first interleaver operation as described in the CDMA standard 3GPP TS 25.212: “Multiplexing and channel coding (FDD)” is as follows:

[0016] The input bit sequence to the first interleaver is denoted by x₀, x₁, x₂, . . . , x_(N−1,) , where N is the number of bits.

[0017] Here, N is guaranteed to be an integer multiple of the number of radio frames in the time transmission intervals (TTI). The output bit sequence from the block interleaver is derived as follows:

[0018] (1)Select the number of columns C from Table 1 depending on the TTI. The columns are numbered 0, 1, . . . , C−1 from left to right.

[0019] (2)Determine the number of rows of the matrix, R defined as:

R=N/C.

[0020] The rows of the matrix are numbered 0, 1, . . . , R−1 from top to bottom.

[0021] (3)Write the input bit sequence into the R×C matrix row by row: $\quad\begin{bmatrix} x_{0} & x_{1} & x_{2} & \cdots & x_{C - 1} \\ x_{C} & x_{C + 1} & x_{C + 2} & \cdots & x_{{2 \times C} - 1} \\ \vdots & \vdots & \vdots & \cdots & \vdots \\ x_{{({R - 1})} \times C} & x_{{{({R - 1})} \times C} + 1} & x_{{{({R - 1})} \times C} + 2} & \cdots & x_{{R \times C} - 1} \end{bmatrix}$

[0022] (4) Perform the inter-column permutation for the matrix based on the pattern <P_(C)(j)>_(jε{0,1, . . . , C−1}) shown in Table 1, where P_(C) (j) is the original column position of the j-th permuted column. After permutation of the columns, the bits are denoted by $\begin{matrix} {\left\{ y_{n} \right\}_{n = 0}^{N - 1}\text{:}} & \quad \end{matrix}$

$\quad\begin{bmatrix} y_{0} & y_{R} & y_{2 \times R} & \cdots & y_{{({C - 1})} \times R} \\ y_{1} & y_{R + 1} & y_{{2 \times R} + 1} & \cdots & y_{{{({C - 1})} \times R} + 1} \\ \vdots & \vdots & \vdots & \cdots & \vdots \\ y_{R - 1} & y_{{2 \times R} - 1} & y_{{3 \times R} - 1} & \cdots & y_{{C \times R} - 1} \end{bmatrix}$

[0023] (5) Read the output bit sequence y₀, y₁, y₂, . . . , y_(C×R−1) of the block interleaver column by column from the inter-column permuted R×C matrix. TABLE 1 Inter-column permutation patterns for 1st interleaving Inter-column permutation patterns TTI Number of columns C <P_(C)(0), P_(C)(1), . . . , P_(C)(C − 1)> 10 ms 1 <0> 20 ms 2 <0, 1> 40 ms 4 <0, 2, 1, 3> 80 ms 8 <0, 4, 2, 6, 1, 5, 3, 7>

[0024] The second interleaver is also a block interleaver, and its structure and interleaver operation are similar to the first interleaver, except that it uses a fixed number of columns for forming interleaver matrix and has to handle padding and pruning dummy bits. Those dummy bits are required if input bit size is not a multiple of the number of columns in the second interleaver.

[0025] The second interleaver operation as described in the CDMA standard 3GPP TS 25.212: “Multiplexing and channel coding (FDD)” is as follows:

[0026] Let the input bit sequence of size M to the second interleaver is denoted by {u_(m)}_(m = 0)^(M − 1).

[0027] (1) Assign the number of columns of the interleaver matrix, C2, as C2=30.

[0028] (2) Determine the number of rows of the matrix, R2, by ${{R2} = \left\lceil \frac{M}{C2} \right\rceil},$

[0029] where ┌.┐ denotes the ceiling operation.

[0030] (3) Write the input bit sequence u₀, u₁, . . . , u_(M−1) into the R2×C2 matrix row-by-row starting with bit y_(o) in column 0 of row 0: $\quad\begin{bmatrix} y_{0} & y_{1} & y_{2} & \cdots & y_{{C2} - 1} \\ y_{C2} & y_{{C2} + 1} & y_{{C2} + 2} & \cdots & y_{{2 \times {C2}} - 1} \\ \vdots & \vdots & \vdots & \cdots & \vdots \\ y_{{({{R2} - 1})} \times {C2}} & y_{{{({{R2} - 1})} \times {C2}} + 1} & y_{{{({{R2} - 1})} \times {C2}} + 2} & \cdots & y_{{{R2} \times {C2}} - 1} \end{bmatrix}$

[0031] where y_(k)=u_(k) for k=0,1, 2, . . . , M−1 and if R2×C2>M, the dummy bits are padded such that y_(k)=0 or 1 for k=M, M+1, . . . , R2×C2−1. These dummy bits are pruned away from the output of the matrix after the inter-column permutation.

[0032] (4) Perform the inter-column permutation for the matrix based on the pattern <P2(j)>_(jε{0,1 , . . . , C2−1}) that is shown in table 2, where P2(j) is the original column position of the j-th permuted column. After permutation of the columns, the bits are denoted by y′_(k). $\quad{\quad\begin{bmatrix} y_{0}^{\prime} & y_{1}^{\prime} & y_{2}^{\prime} & \cdots & y_{{C2} - 1}^{\prime} \\ y_{C2}^{\prime} & y_{{C2} + 1}^{\prime} & y_{{C2} + 2}^{\prime} & \cdots & y_{{2 \times {C2}} - 1}^{\prime} \\ \vdots & \vdots & \vdots & \cdots & \vdots \\ y_{{({{R2} - 1})} \times {C2}}^{\prime} & y_{{{({{R2} - 1})} \times {C2}} + 1}^{\prime} & y_{{{({{R2} - 1})} \times {C2}} + 2}^{\prime} & \cdots & y_{{{R2} \times {C2}} - 1}^{\prime} \end{bmatrix}}$

[0033] (5) The output of the block interleaver is the bit sequence read out column by column from the inter-column permuted R2×C2 matrix. The output is pruned by deleting dummy bits that were padded to the input of the matrix before the inter-column permutation, i.e. bits y′_(k) that corresponds to bits y_(k) with k>M are removed from the output. TABLE 2 Inter-column permutation pattern for 2nd interleaving Number of columns Inter-column permutation pattern C2 <P2(0), P2(1), . . . , P2(C2 − 1)> 30 <0, 20, 10, 5, 15, 25, 3, 13, 23, 8, 18, 28, 1, 11, 21, 6, 16, 26, 4, 14, 24, 19, 9, 29, 12, 2, 7, 22, 27, 17>

[0034] The method, as illustrated in FIG. 2, begins with the bit sequence X at input 10. The first interleaving is performed using a spline linear model at 12. The interleaved bit sequence is Y. After other processing, a second interleaving may be performed. The bit sequence U has L bits added at 14. Next, there is a determination of the location of the padding bits in the second interleaved bit sequence at 16. Then, a second interleaving is performed using the spline linear model, except at the determined bit locations at 18. The resulting bit sequence V is outputted at 20. The specific process of performing the first and second interleaving is described in the following.

[0035] The method for the interleaving is performed in software and without forming an actual matrix of the bit sequence. It is uses a bridge function base on a spline linear model.

[0036] Let {π_(n)}_(n = 0)^(N − 1)

[0037] denote the original input bit position of the n-th interleaved bit position. Then the interleaver operation can be described as y_(n)=x_(π) _(n) , n=0, . . . , N−1 having a bridge function between π_(n) and n, n=0, . . . , N−1, based on a spline linear model. The bridging function can be defined as π_(n)^(r_(j)) = α^(r_(j))n + β^(r_(j)),

[0038] where n=0,1,2, . . . , N−1, and {r_(j): j=0,1,2, . . C−1} denote the sets of discrete time intervals, $\begin{matrix} {{{r_{0} = \left\{ {0,1,2,\ldots \quad,{\frac{N}{C} - 1}} \right\}},{r_{1} = \left\{ {\frac{N}{C},{\frac{N}{C} + 1},{\frac{N}{C} + 2},\ldots \quad,{\frac{2N}{C} - 1}} \right\}},\vdots}{r_{C - 1} = {\left\{ {\frac{\left( {C - 1} \right)N}{C},{\frac{\left( {C - 1} \right)N}{C} + 1},{\frac{\left( {C - 1} \right)N}{C} + 2},\ldots \quad,{N - 1}} \right\}.}}} & (1) \end{matrix}$

[0039] For each r_(j), the parameters α^(r) ^(_(j)) and β^(r) ^(_(j)) are obtained as:

α^(r) ^(_(j)) =C, ∀j,

β^(r) ^(_(j)) =−j×N+P _(C)(j).

[0040] That is, π_(n), regress over n by the following relation: $\begin{matrix} {{\pi_{n}^{r_{j}} = {{C \times n} - {j \times N} + {P_{C}(j)}}},{j = 0},1,\ldots \quad,{C - 1.}} & (2) \end{matrix}$

[0041] Now with the calculation of index in equation (2), the interleaving can be done by: $\begin{matrix} {{y_{n}^{r_{j}} = x_{{C \times n} - {j \times N} + {P_{C}{(j)}}}},{n \in {r_{j}.}}} & (3) \end{matrix}$

[0042] The second interleaver can be designed in the same way that the first interleaver is designed. However, since the dummy bit padding and pruning have to be considered, in addition to equation (3), another step is necessary. The location of the padding bits in the sequence needed to be identified and interleaving not performed at those locations.

[0043] Let D_(d) and d denote a set of dummy bit positions and the number of dummy bits, respectively. That is, D_(d)={R2×C2−1,R2×C2−2, . . . , R2×C2−d}, if 1≦d≦29.

[0044] Note that if M=R2×C2, then D_(d) becomes an empty set.

[0045] Let D_(d)^(shuffle)

[0046] be modified D_(d) after column permutation in Table 2.

[0047] For the 3GPP second interleaver, the D_(d)^(shuffle)

[0048] conditioned on d is given by, $\begin{matrix} {{{D_{0}^{shuffle} = \left\{ {empty} \right\}},{D_{1}^{shuffle} = \left\{ {{{R2} \times 24} - 1} \right\}},{D_{2}^{shuffle} = \left\{ {{{{R2} \times 12} - 1},{{{R2} \times 24} - 1}} \right\}},{D_{3}^{shuffle} = \left\{ {{{{R2} \times 12} - 1},{{{R2} \times 24} - 1},{{{R2} \times 29} - 1}} \right\}},\vdots}{D_{29}^{shuffle} = {\left\{ {{{{R2} \times 2} - 1},{{{R2} \times 3} - 1},\ldots \quad,{{{R2} \times 30} - 1}} \right\}.}}} & (4) \end{matrix}$

[0049] Basically, the second interleaving can be done by equation (3), but because of dummy bits, another time index is required. One type of index, say m, is used for writing interleaved bits, and the other, say n, is for reading the input bits. Let U′ denote the zero padded input sequence to the 2^(nd) interleaver.

[0050] If the dummy bit size is d, the proposed second interleaving procedure is as follows:

[0051] 1. Set the modified position vector, D_(d)^(shuffle) = {R2 × k₁ − 1, …  , R2 × k_(d) − 1},

[0052] where k₁₌₂₄, k₂=12, k₃=29 , . . . .

[0053] 2. If n ∉ D_(d)^(shuffle),

[0054] interleave v_(m) by v_(m)^(r_(j)) = u_(C2 × n − j × C2 × R2 + P_(C2)(j))^(′),

$\begin{matrix} {{{0 \leq m < M},{0 \leq {n\left( {{C2} \times {R2}} \right)}},{and}}{{r_{0} = \left\{ {0,1,2,\ldots \quad,{{R2} - 1}} \right\}},{r_{1} = \left\{ {{R2},{{R2} + 1},{{R2} + 2},\ldots \quad,{{2 \times {R2}} - 1}} \right\}},{{\vdots r_{{C2} - 1}} = {\left\{ {{\left( {{C2} - 1} \right) \times {R2}},{{\left( {{C2} - 1} \right) \times {R2}} + 1},\ldots \quad,{{{C2} \times {R2}} - 1}} \right\}.}}}} & (5) \end{matrix}$

[0055] 3. If n∈  D_(d)^(shuffle),

[0056] skip interleaving and do not increase the interleaved array index m while increase n.

[0057] Although the present invention has been described and illustrated in detail, it is to be clearly understood that this is done by way of illustration and example only and is not to be taken by way of limitation. The first interleaver has an input sequence x and an output sequence y, and the second interleaver has an input sequence u and an output sequence v. With respect to the claims, both interleavers will use the same x,y notation. The spirit and scope of the present invention are to be limited only by the terms of the appended claims. 

What is claimed:
 1. A method of performing interleaving or deinterleaving in a communication system having at least one interleaver at the transmitter and at least one deinterleaver at the receiver, the method comprising: interleaving or deinterleaving the input bit sequence X_(n) as follows: y_(n)=x_(π) _(n) , n=0, . . . , N−1, using a bridge function between π_(n) and n, n=0, . . . , N−1, based on a spline linear model.
 2. The method of claim 1, wherein the bridge function is π_(n)^(r_(j)) = C × n − j × N + P_(C)(j),

j=0,1, . . . , C−1, where P_(C)(j) is the permutation pattern and r_(j) denote the sets of discrete time intervals, and the interleaving or deinterleaving is y_(n)^(r_(j)) = x_(C × n − j × N + P_(C)(j)), n ∈ r_(j).


3. The method of claim 1, wherein the system includes a first and a second interleaving or deinterleaving and the method is performed for both.
 4. The method of claim 3, wherein the second interleaving or deinterleaving includes: adding padding bits; determining the location in an interleaved or deinterleaved bit sequence of the padding bits; and skip interleaving or deinterleaving for the determined locations.
 5. The method of claim 4, wherein y has an index m, and x has an index n; and the index m is not increased, and the index n is increased for determined locations of padding.
 6. The method of claim 1, wherein the interleaving or deinterleaving includes: adding padding bits; determining the location in an interleaved or deinterleaved bit sequence of the padding bits; and skip interleaving or deinterleaving for the determined locations.
 7. The method of claim 6, wherein y has an index m, and x has an index n; and the index m is not increased, and the index n is increased for determined locations of padding.
 8. The method of claim 1, wherein the method is performed without forming a matrix of the bit sequence.
 9. The method of claim 1, wherein the method is performed in software. 